Block SOR methods for rank-deficient least-squares problems
نویسندگان
چکیده
منابع مشابه
Block SOR methods for rank-de cient least-squares problems
Many papers have discussed preconditioned block iterative methods for solving full rank least-squares problems. However very few papers studied iterative methods for solving rank-de cient least-squares problems. Miller and Neumann (1987) proposed the 4-block SOR method for solving the rank-de cient problem. Here a 2-block SOR method and a 3-block SOR method are proposed to solve such problem. T...
متن کاملGauss-Seidel Iterative Methods for Rank Deficient Least Squares Problems
We study the semiconvergence of Gauss-Seidel iterative methods for the least squares solution of minimal norm of rank deficient linear systems of equations. Necessary and sufficient conditions for the semiconvergence of the Gauss-Seidel iterative method are given. We also show that if the linear system of equations is consistent, then the proposed methods with a zero vector as an initial guess ...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملRank-Deficient Nonlinear Least Squares Problems and Subset Selection
We examine the local convergence of the Levenberg–Marquardt method for the solution of nonlinear least squares problems that are rank-deficient and have nonzero residual. We show that replacing the Jacobian by a truncated singular value decomposition can be numerically unstable. We recommend instead the use of subset selection. We corroborate our recommendations by perturbation analyses and num...
متن کاملRank-deficient and Ill-conditioned Nonlinear Least Squares Problems
In this paper we review classical results by Ben-Israel, Boggs, and Tanabe on algorithms for rank-deficient nonlinear least squares problems and compare them to our recent perturbation theory results for such problems. Using a simple example, we show how sufficiently large perturbations can lead to poor convergence or even incorrect results, and how the application of subset selection can solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1998
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(98)00114-9